ISRO CSE 2016
Q31.
Consider the following statements about the context free grammarG=\{S \rightarrow S S, S \rightarrow a b, S \rightarrow b a, S \rightarrow \epsilon\}I. G is ambiguous II. G produces all strings with equal number of a's and b's III. G can be accepted by a deterministic PDA. Which combination below expresses all the true statements about G?Q32.
In which one of the following page replacement policies, Belady's anomaly may occur?Q33.
For the real time operating system, which of the following is the most suitable scheduling scheme?Q34.
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any n>0 is:Q35.
The message 11001001 is to be transmitted using the CRC polynomial x^3 +1 to protect it from errors. The message that should be transmitted is:Q36.
Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the minimum number of bits (I) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.Q37.
In Ethernet CSMA/CD, the special bit sequence transmitted by media access management to handle collision is calledQ38.
In a token ring network the transmission speed is 10^7 bps and the propagation speed is 200 meters/\mu s. The 1-bit delay in this network is equivalent to:Q39.
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then